//
//  BFSSolution.hpp
//  labuladong
//
//  Created by 刘振舟 on 2023/8/31.
//

#ifndef BFSSolution_hpp
#define BFSSolution_hpp

#include <stdio.h>
#include <queue>
#include <string>
#include <unordered_set>

using namespace std;

struct TreeNode {
    int val;
    TreeNode *left;
    TreeNode *right;
    TreeNode() : val(0), left(nullptr), right(nullptr) {}
    TreeNode(int x) : val(x), left(nullptr), right(nullptr) {}
    TreeNode(int x, TreeNode *left, TreeNode *right) : val(x), left(left), right(right) {}
};


class BFSSolution {
public:
    int minDepth(TreeNode* root);
    int openLock(vector<string>& deadends, string target);
};

#endif /* BFSSolution_hpp */
